Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

北电网络安全路由技术

北电网络提供的Contivity解决方案不仅可以使用户建立各种类型的VPN，而且还可以把这些VPN集成到未来的融合话音和数据的网络中。该方案已实现了安全路由选择；可通过多种技术支持鉴权功能，从而实现安全接入；允许用户使用其各自的安全性配置文件设置；其设计中没有“后门”，重点介绍了Contivity 2700网关的主要特征及其优势。     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.     

Treatment of Natural Geometry in Finite Volume River Flow Computations

A method is proposed for the treatment of irregular bathymetry in one-dimensional finite volume computations of open-channel flow. The strategy adopted is based on a reformulation of the Saint-Venant equations. In contrast with the usual treatment of topography effects as source terms, the method accounts for slope and nonprismaticity by modifying the momentum flux. This makes it possible to precisely balance the hydrostatic pressure contributions associated with variations in valley geometry. The characteristic method is applied to the revised equations, yielding topographic corrections to the numerical fluxes of an upwind scheme. Further adaptations endow the scheme with an ability to capture transcritical sections and wetting fronts in channels of abrupt topography. To test the approach, the scheme is first applied to idealized benchmark problems. The method is then used to route a severe flood through a complex river system: the Tanshui in Northern Taiwan. Computational results compare favorably with gauge records. Discrepancies in water stage represent no more than a fraction of the magnitude of typical bathymetry variations.     

Study on a Distributed Wavelength Routing Algorithm in WDM Optical Transport Networks

A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load (AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed results show that the race condition has a major impact on network performance only under light traffic load, while under medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6% under medium traffic load.     

柔性制造系统的负荷分配及路径规划方法

柔性是柔性制造系统（ＦＭＳ）的一个基本优点，但这一基本优点却往往被人们忽视，许多现在运行的ＦＭＳ不是缺乏柔性，就是没能充分利用可获得的柔性来提高生产效率。柔性制造系统的负荷分配和路径规划问题正是这种柔性的一个主要方面，然而，路规划决策却往往被。其中一个主要原因人们仍不能从传统的生产管理概念中解放出来。本文在明确概念区分的基础上，提出了一种柔性制造系统的负荷分配和路径规划的线性规划模型，其主要特点是     

多芯片组件的布线

布线是多芯片组件（ＭＣＭ）ＣＡＤ中的一个关键步骤，由于ＭＣＭ的封装密度很高，因此，因此，其布线问题也较传统的ＩＣ或ＰＣＢ布线更为困难，指出了ＭＣＭ布线中存在的问题，介绍了当前用于ＭＣＭ布线的几种方法，着重讨论了ＳＬＩＣＥ布线法和４通孔布线法，对这几种方法进行了比较，４通孔布线法可直接产生详细布线结果，有利于节省成本和提高布线效率。     

Interference effects from grammatically unavailable constituents during sentence processing.

Evidence from 3 experiments reveals interference effects from structural relationships that are inconsistent with any grammatical parse of the perceived input. Processing disruption was observed when items occurring between a head and a dependent overlapped with either (or both) syntactic or semantic features of the dependent. Effects of syntactic interference occur in the earliest online measures in the region where the retrieval of a long-distance dependent occurs. Semantic interference effects occur in later online measures at the end of the sentence. Both effects endure in offline comprehension measures, suggesting that interfering items participate in incorrect interpretations that resist reanalysis. The data are discussed in terms of a cue-based retrieval account of parsing, which reconciles the fact that the parser must violate the grammar in order for these interference effects to occur. Broader implications of this research indicate a need for a precise specification of the interface between the parsing mechanism and the memory system that supports language comprehension. (PsycINFO Database Record (c) 2010 APA, all rights reserved)